A Propositional CONEstrip Algorithm
نویسنده
چکیده
We present a variant of the CONEstrip algorithm for checking whether the origin lies in a finitely generated convex cone that can be open, closed, or neither. This variant is designed to deal efficiently with problems where the rays defining the cone are specified as linear combinations of propositional sentences. The variant differs from the original algorithm in that we apply row generation techniques. The generator problem is WPMaxSAT, an optimization variant of SAT; both can be solved with specialized solvers or integer linear programming techniques. We additionally show how optimization problems over the cone can be solved by using our propositional CONEstrip algorithm as a preprocessor. The algorithm is designed to support consistency and inference computations within the theory of sets of desirable gambles. We also make a link to similar computations in probabilistic logic, conditional probability assessments, and imprecise probability theory.
منابع مشابه
The CONEstrip Algorithm
Uncertainty models such as sets of desirable gambles and (conditional) lower previsions can be represented as convex cones. Checking the consistency of and drawing inferences from such models requires solving feasibility and optimization problems. We consider finitely generated such models. For closed cones, we can use linear programming; for conditional lower prevision-based cones, there is an...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملEstablishing Propositional Relations in Reading Stories
This study examined the establishment of coherence relations by Persian EFL learners in their reading of stories. 201 undergraduate EFL learners read narrative passages and selected appropriate coherence elements of different types necessary for the proper construction of meaning. The results demonstrated a consistent pattern of a text-specific hierarchy for the comprehension of conjunctive rel...
متن کاملLeveraging and Learning Propositional Functions for Large State Spaces in Planning and Reinforcement Learning
Planning in large state spaces is a normally computationally infeasible task that crops up in many practical robotics problems. I present a means of leveraging propositional functions in object-oriented Markov Decision Processes (OO-MDPs) to prune state spaces which yields both significant computation speedups as well as generally better plans when applied to baseline planners. Modern reinforce...
متن کاملLogic-Based Abduction New Polynomial Classes for Logic-Based Abduction
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of ...
متن کامل